Flyspeck I: Tame Graphs
نویسندگان
چکیده
We present a verified enumeration of tame graphs as defined in Hales’ proof of the Kepler Conjecture and confirm the completeness of Hales’ list of all tame graphs while reducing it from 5128 to 2771 graphs.
منابع مشابه
Tame Plane Graphs
These theories present the verified enumeration of tame plane graphs as defined by Thomas C. Hales in his revised proof of the Kepler Conjecture. Compared with his original proof, the notion of tameness has become simpler, there are many more tame graphs, but much of the earlier verification [1] carries over. For more details see http:// code.google.com/p/flyspeck/ and the forthcoming book “Den...
متن کاملThe number of graphs and a random graph with a given degree sequence
We consider the set of all graphs on n labeled vertices with prescribed degrees D = (d1, . . . , dn). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within a relative error which approaches 0 as n grows. As a corollary, we prove that the structure of a random graph with a given tame degree sequence D is well...
متن کاملTowards a Verified Enumeration of All Tame Plane Graphs
We contribute to the fully formal verification of Hales’ proof of the Kepler Conjecure by analyzing the enumeration of all tame plane graphs. We sketch a formalization of plane graphs, tameness and Hales’ enumeration procedure in Higher Order Logic. The correctness of the enumeration is partially verified (which uncovered a small mismatch between Hales’ definition of tameness and his enumeratio...
متن کاملTame Loci of Generalized Local Cohomology Modules
Let $M$ and $N$ be two finitely generated graded modules over a standard graded Noetherian ring $R=bigoplus_{ngeq 0} R_n$. In this paper we show that if $R_{0}$ is semi-local of dimension $leq 2$ then, the set $hbox{Ass}_{R_{0}}Big(H^{i}_{R_{+}}(M,N)_{n}Big)$ is asymptotically stable for $nrightarrow -infty$ in some special cases. Also, we study the torsion-freeness of graded generalized local ...
متن کاملFormalizing plane graph theory: towards a formalized proof of the Kepler conjecture
In 1998, Thomas Hales published a proof of the Kepler Conjecture, which states that the cubic close packing is the densest possible packing of equallysized spheres. The proof is by exhaustion on a set of 3050 plane graphs satisfying certain properties, called tame plane graphs. The enumeration of this set has been generated by a computer program, hence the completeness of this enumeration is es...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2006 شماره
صفحات -
تاریخ انتشار 2006